Saturation Number of $tK_{l,l,l}$ in the Complete Tripartite Graph

For fixed graphs $F$ and $H$, a graph $G\subseteq F$ is $H$-saturated if there no copy of $H$ in $G$, but for any edge $e\in E(F)\setminus E(G)$, $G+e$. The saturation number $F$, denoted $sat(F,H)$, the minimum edges an subgraph $F$. In this paper, we study numbers $tK_{l,l,l}$ complete tripartite $K_{n_1,n_2,n_3}$. $t\ge 1$, $l\ge 1$ $n_1,n_2$ $n_3$ sufficiently large, determine $sat(K_{n_1,n_2,n_3},tK_{l,l,l})$ exactly.